Linearized Coupled Cluster Correction on the Antisymmetric Product of 1 reference orbital Geminals

We present a Linearized Coupled Cluster (LCC) correction based on an Antisymmetric Product of 1 reference orbital Geminals (AP1roG) reference state. In our LCC ansatz, the cluster operator is restricted to double and to single and double excitations as in standard single-reference CC theory. The performance of the AP1roG-LCC models is tested for the dissociation of diatomic molecules (C$_2$ and F$_2$), spectroscopic constants of the uranyl cation (UO$_2^{2+}$), and the symmetric dissociation of the H$_{50}$ hydrogen chain. Our study indicates that an LCC correction based on an AP1roG reference function is more robust and reliable than corrections based on perturbation theory, yielding spectroscopic constants that are in very good agreement with theoretical reference data.Comment: 9 pages, 4 figure

Handedness and Child Development

Left-handedness is historically associated with poorer outcomes for adults. Yet recent work has suggested that there may be positive labour market returns for left-handed males. This paper examines whether handedness is also associated with poorer outcomes for children and whether this differs by genders. The paper examines a wide set of outcomes for children as they age from 42 months to 14 years. We find the main penalty is not from being left-handed, but is from not having a dominant hand early in life. This penalty is larger for girls than boys by age 14, indicating that early deficits of non-right handed boys appear to fall as they age. For girls, being left-handed and especially mixed-handed at early ages is associated with persistent cognitive attainment deficits, mainly focused at the lower end of the ability distribution.Handedness, child outcomes

Modulatory effects of positive mood on cognition : lessons from attention and error monitoring.

A

“Saving lives”: Adapting and adopting Human Papilloma Virus (HPV) vaccination in Austria

AbstractVaccination against the sexually transmitted Human Papilloma Virus (HPV), a necessary agent for the development of cervical cancer, has triggered much debate. In Austria, HPV policy turned from “lagging behind” in 2008 into “Europe's frontrunner” by 2013. Drawing on qualitative research, the article shows how the vaccine was transformed and made “good enough” over the course of five years. By means of tinkering and shifting storylines, policy officials and experts disassociated the vaccine from gender, vaccine manufacturers, and youth sexuality. Ultimately, the HPV vaccine functioned to strengthen the national immunization program. To this end, preventing an effective problematization of the extant screening program was essential

Zafar, Watershed of Late Pre-Islamic Culture

Research since 1998 sheds light on the formative role which Zafar as capital of the Himyarite confederacy played in the history of Old South Arabia. Since most of the excavation reports on Zafar are still in press, new excavation results from the site are not commonly known. Highlights of the excavation from 2000 to 2006 include the discovery of the Stone Building. The main topics of our paper include the nature of the defences, the appearance of Zafar’s cityscape, and its post-Himyarite history. The final section discusses briefly and from an archaeological point of view select aspects of late pre-Islamic Judaism in the highlands

Triangles and Girth in Disk Graphs and Transmission Graphs

Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk graph D(S) is the undirected graph with vertex set S and an undirected edge between two sites s, t in S if and only if |st| <= r_s + r_t, i.e., if the disks with centers s and t and respective radii r_s and r_t intersect. Disk graphs are used to model sensor networks. Similarly, the transmission graph T(S) is the directed graph with vertex set S and a directed edge from a site s to a site t if and only if |st| <= r_s, i.e., if t lies in the disk with center s and radius r_s. We provide algorithms for detecting (directed) triangles and, more generally, computing the length of a shortest cycle (the girth) in D(S) and in T(S). These problems are notoriously hard in general, but better solutions exist for special graph classes such as planar graphs. We obtain similarly efficient results for disk graphs and for transmission graphs. More precisely, we show that a shortest (Euclidean) triangle in D(S) and in T(S) can be found in O(n log n) expected time, and that the (weighted) girth of D(S) can be found in O(n log n) expected time. For this, we develop new tools for batched range searching that may be of independent interest